finite sequence meaning in Chinese
有限序列
Examples
- Any finite sequence of symbols from an alphabet a is called a string .
由字母表A中的符号所组成的任何有穷序列，被称为符号串。 - Any finite sequence of symbols from an alphabet a is called a string
由字母表a中的符号所组成的任何有穷序列，被称为符号串。 - The one kind of improved fwt ( fast wavelet transform ) algorithm for a finite sequence is proposed after studying theory of multiresolution analysis and analyzing technical characteristics of dsp . the implementation of the periodic extension of the fwt on dsp is described in detail and the corresponding fwt assembly code is described for the dsp tms320c3x series
在充分研究多分辨分析理论和分析信号处理器技术特点的基础上，针对dsptms320c3x的特点，提出了一种有限序列的fwt (快速小波变换)的改进算法，详细阐述了信号处理器上fwt的周期性扩展的实现问题，用dsptms320c3x汇编语言实现了改进的fwt算法。